Design and simulation analysis of non-receiver aware and receiver aware multicast location prediction based routing protocols for mobile ad hoc networks

We present multicast extensions to our recently proposed Location Prediction Based Routing (LPBR) protocol, referred to as NR-MLPBR and R-MLPBR, to simultaneously reduce the number of multicast tree discoveries and number of links per tree and/or the hop count per source-receiver path in mobile ad hoc networks (MANETs). Nodes running NR-MLPBR are not aware of the receivers of the multicast group; R-MLPBR assumes each receiver node knows the identity of the other receivers of the group. Upon failure of a path to the source, a receiver attempts to locally construct a global topology using the location and mobility information collected during the latest broadcast tree discovery. NR-MLPBR predicts a path that has the minimum number of hops to the source and R-MLPBR predicts a path to the source that has the minimum number of non-receiver nodes. If the predicted path exists in the network at that time instant, the source accommodates the path as part of the multicast tree and continues to send multicast packets in the modified tree without attempting a broadcast discovery. Simulation results show that NR-MLPBR and R-MLPBR perform better than the minimum-hop based and minimum-link based on-demand multicast MANET routing protocols under different conditions of node mobility, density and group size.